Homotopy resolutions of semi-simplicial complexes

Finite Free Resolutions and 1-Skeletons of Simplicial Complexes

A technique of minimal free resolutions of Stanley–Reisner rings enables us to show the following two results: (1) The 1-skeleton of a simplicial (d − 1)-sphere is d-connected, which was first proved by Barnette; (2) The comparability graph of a non-planar distributive lattice of rank d − 1 is d-connected.

Semi-Simplicial Complexes and Singular Homology

Simplicial simple-homotopy of flag complexes in terms of graphs

A flag complex can be defined as a simplicial complex whose simplices correspond to complete subgraphs of its 1-skeleton taken as a graph. In this article, by introducing the notion of s-dismantlability, we shall define the s-homotopy type of a graph and show in particular that two finite graphs have the same s-homotopy type if, and only if, the two flag complexes determined by these graphs hav...

Semi-simplicial Types in Logic-enriched Homotopy Type Theory

The problem of defining Semi-Simplicial Types (SSTs) in Homotopy Type Theory (HoTT) has been recognized as important during the Year of Univalent Foundations at the Institute of Advanced Study [14]. According to the interpretation of HoTT in Quillen model categories [5], SSTs are type-theoretic versions of Reedy fibrant semi-simplicial objects in a model category and simplicial and semi-simplic...

Simplicial Resolutions and Ganea Fibrations

In this work, we compare the two approximations of a pathconnected space X, by the Ganea spaces Gn(X) and by the realizations ‖Λ•X‖n of the truncated simplicial resolutions emerging from the loop-suspension cotriple ΣΩ. For a simply connected space X, we construct maps ‖Λ•X‖n−1 → Gn(X) → ‖Λ•X‖n over X, up to homotopy. In the case n = 2, we prove the existence of a map G2(X) → ‖Λ•X‖1 over X (up ...